Convergence Criterion of Inexact Methods for Operators with Hölder Continuous Derivatives

نویسندگان

  • Weiping Shen
  • Chong Li
چکیده

Convergence criterion of the inexact methods is established for operators with hölder continuous first derivatives. An application to a special nonlinear Hammerstein integral equation of the second kind is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An inexact alternating direction method with SQP regularization for the structured variational inequalities

In this paper, we propose an inexact alternating direction method with square quadratic proximal  (SQP) regularization for  the structured variational inequalities. The predictor is obtained via solving SQP system  approximately  under significantly  relaxed accuracy criterion  and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...

متن کامل

Convergence Ball Analysis of a Modified Newton’s Method Under Hölder Continuous Condition in Banach Space

A modified Newton’s method which computes derivatives every other step is used to solve a nonlinear operator equation. An estimate of the radius of its convergence ball is obtained under Hölder continuous Fréchet derivatives in Banach space. An error analysis is given which matches its convergence order. 2010 Mathematics Subject Classification: 65B05, 47817, 49D15

متن کامل

Convergence rates with inexact non-expansive operators

In this paper, we present a convergence rate analysis for the inexact Krasnosel’skĭı– Mann iteration built from nonexpansive operators. Our results include two main parts: we first establish global pointwise and ergodic iteration–complexity bounds, and then, under a metric subregularity assumption, we establish local linear convergence for the distance of the iterates to the set of fixed points...

متن کامل

Global convergence of an inexact interior-point method for convex quadratic‎ ‎symmetric cone programming‎

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

متن کامل

Convergence analysis of an extended Auxiliary Problem Principle for solving variational inequalities

We study the Extended Proximal Auxiliary Problem Principle-method (EPAPP) by Kaplan and Tichatschke [17, 20] for solving variational inequalities whose operator is the sum of a maximal monotone and a continuous operator. As in comparable methods using Bregman distances the authors required that the operator of the considered variational inequality (here called main operator) is paramonotone (se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008